Class Graph Views
نویسندگان
چکیده
An application typically has many conceptually separate pieces of behavior written over a common class graph. Each behavior makes different assumptions about the form of the class graph and the methods provided by the classes. The behaviors’ overlapping assumptions make it difficult to modify the class graph in mid-development; each modification can break assumptions that must be tracked down and mended. We propose a flexible system for providing separate views of the class graph to each behavior. Each view specifies only the details that the particular behavior makes assumptions about. By programming to the simplified view of the class graph, each behavior becomes more robust to modifications to the class graph. Inevitably, modifications to the class graph will require that broken assumptions be patched up, but these modifications need only be performed in the view specification, simplifying maintenance. A view can be applied simultaneously to several parts of the class graph, promoting code reuse. A key innovation is that the same view is exported regardless of how is it applied. This is vital to being able to transparently layer views and thus minimize maintenance costs. A common organization is to have a general purpose lower level view provide a stable interface to a changing class graph and to build high level views tailored to specific behavior on top of that. This approach offers minimized maintenance costs (by virtue of all high-level views sharing the provided low-level interface), and simplified behavior (as each behavior sees a class graph tailored to its needs).
منابع مشابه
Graph Structured Views and Their Incremental Maintenance
Yue Zhuge and Hector Garcia-Molina Computer Science Department Stanford University Stanford, CA 94305-2140, USA fzhuge,[email protected] Abstract We study the problem of maintaining materialized views of graph structured data. The base data consists of records containing identi ers of other records. The data could represent traditional objects (with methods, attributes, and a class hierar...
متن کاملA NOTE ON THE COMMUTING GRAPHS OF A CONJUGACY CLASS IN SYMMETRIC GROUPS
The commuting graph of a group is a graph with vertexes set of a subset of a group and two element are adjacent if they commute. The aim of this paper is to obtain the automorphism group of the commuting graph of a conjugacy class in the symmetric groups. The clique number, coloring number, independent number, and diameter of these graphs are also computed.
متن کامل3 Managing Views in a Program Understanding Tool
This work was supported in part by the Natural Sciences and Engineering Research Council of Canada. Program understanding tools typically offer built-in visual representations of the subject software, such as call graphs and class hierarchies, and textual representations, such as cross-reference listings and exact-interface reports. It is useful to bundle a number of these visual and textual fr...
متن کاملRigorous Testing by Merging Structural and Behavioral UML Representations
Error detection and correction in the design phase can reduce total costs and time to market. Yet, testing of design models usually consists of walk-throughs and inspections both of which lack the rigor of systematic testing. Test adequacy criteria for UML models help define necessary objectives during the process of test creation. These test criteria require coverage of various parts of UML mo...
متن کاملSome finite groups with divisibility graph containing no triangles
Let $G$ be a finite group. The graph $D(G)$ is a divisibility graph of $G$. Its vertex set is the non-central conjugacy class sizes of $G$ and there is an edge between vertices $a$ and $b$ if and only if $a|b$ or $b|a$. In this paper, we investigate the structure of the divisibility graph $D(G)$ for a non-solvable group with $sigma^{ast}(G)=2$, a finite simple group $G$ that satisfies the one-p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998